Minimum-drag shapes in magnetohydrodynamics

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theory of optimum shapes in free-surface flows. Part 2. Minimum drag profiles in infinite cavity flow

The problem considered here is to determine the shape of a symmetric twodimensional plate so that the drag of this plate in infinite cavity flow is a minimum. With the flow assumed steady and irrotational, and the effects due to gravity ignored, the drag of the plate is minimized under the constraints that the frontal width and wetted arc-length of the plate are fixed. The extremization process...

متن کامل

Explosively launched spores of ascomycete fungi have drag-minimizing shapes.

The forcibly launched spores of ascomycete fungi must eject through several millimeters of nearly still air surrounding fruiting bodies to reach dispersive air flows. Because of their microscopic size, spores experience great fluid drag, and although this drag can aid transport by slowing sedimentation out of dispersive air flows, it also causes spores to decelerate rapidly after launch. We hyp...

متن کامل

Stability of critical shapes for the drag minimization problem in Stokes flow

We study the stability of some critical (or equilibrium) shapes in the minimization problem of the energy dissipated by a fluid (i.e. the drag minimization problem) governed by the Stokes equations. We first compute the shape derivative up to the second order, then provide a sufficient condition for the shape Hessian of the energy functional to be coercive at a critical shape. Under this condit...

متن کامل

Efficient Approximation Algorithms for Minimum Enclosing Convex Shapes

We address the problem of Minimum Enclosing Ball (MEB) and its generalization to Minimum Enclosing Convex Polytope (MECP). Given n points in a d dimensional Euclidean space, we give a O(nd/ √ ) algorithm for producing an enclosing ball whose radius is at most away from the optimum. In the case of MECP our algorithm takes O(1/ ) iterations to converge. In both cases we improve the existing resul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

سال: 2011

ISSN: 1364-5021,1471-2946

DOI: 10.1098/rspa.2011.0224